Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
نویسندگان
چکیده
We consider the problem of electing a leader on a ring of nameless processors by de terministic and self stabilizing protocols A processor can read the state of its neighbors and its own state to determine if it is enabled A central demon scheduler picks an enabled processor to make an atomic move In an atomic move the processor changes to a new state which is a function of its old state and the states of its two neighbors It is well known that no deterministic protocol exists if n the size of the ring is composite If the size of the ring is a prime surprisingly there is a deterministic leader election protocol In this paper we present a protocol for bidirectional rings of prime size Our protocol is deterministic uses constant space and is self stabilizing in O n steps
منابع مشابه
Deterministic silence and self stabilizing leader election algorithm on id based ring
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader el...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based rings
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have bound on their id values The id values of processors in a ring whose size is N have to be inferior to N k The size of commu nication registers required by the algorithm is constant The algorithm stabilizes in k N time In DGS Dolev Gouda and Schneider have e...
متن کاملDeterministic , Constant Space , Self - Stabilizing Leader Electionon Uniform
We consider the problem of electing a leader on a ring of nameless processors by de-terministic and self-stabilizing protocols. A processor can read the state of its neighbors (and its own state) to determine if it is enabled. A central demon (scheduler) picks an enabled processor to make an atomic move. In an atomic move, the processor changes to a new state which is a function of its old stat...
متن کاملA Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous self-stabilizing algorithms for this problem. In other models or when the ring size is composite,...
متن کاملSelf-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...
متن کامل